0 Fields with pseudo - exponentiation
نویسنده
چکیده
1 Introduction This research is motivated by the study of model-theoretical properties of classical 'analytic' structures, i.e. ones having natural analytic representation (see also [Z]). For example, the structure of complex numbers as a field with exponentiation C exp = (C, +, ·, exp). One of the questions we can ask is whether C exp is quasi-minimal, i.e. any definable subset of C exp is either countable or of power continuum. Another question is about homogeneity of the structure; we do not know any its automorphism except the identity and the complex conjugation. In general we would like to understand the nature of analytic dimension in a context close to model-theoretic stability theory. A slightly weaker analytic structure C (2) exp is a two-sorted structure with both sorts C(1) and C(2) being copies of complex numbers, on both sorts the field structure is given and there is a mapping exp : C(1) → C(2) in the language. The model theory of the both structures, as well as of many others of this kind, seems very hard to study directly. We study here model theory of abstract analogues of C (2) exp. We start by considering the class E p of two-sorted structures of the form (D, ex, R), D, the domain of a mapping ex is a field of characteristic zero, R, a field of characteristic p and ex is a homomorphism of the additive group of D onto the multiplicative group R × of R. Following the ideology of Hrushovski's construction of non-classical structures with nice dimension notion (see [H]), 1 we consider a notion of a predimension δ(X) for finite subsets X ⊆ D defined as δ(X) = tr.d.(X) + tr.d.(ex(X)) − dim Q (X), here dim Q (X) is the dimension of the Q-linear space generated by X. We then define the subclass S p of E p , the weak Schanuel class as the class of structures where δ(X) ≥ 0 for all X and the kernel of ex is standard (a cyclic additive subgroup in case p = 0). Recall that the Schanuel conjecture [L] states that, given Q-linearly independent complex numbers x holds. We prove that the weak Schanuel class S p is non-empty. We study the predimension δ and the relation A ≤ B following the Hrushovski pattern. We define a notion of exponentially-algebraically closed structures, which are just existentially closed structures with …
منابع مشابه
A Note on the Axioms for Zilber's Pseudo-Exponential Fields
We show that Zilber’s conjecture that complex exponentiation is isomorphic to his pseudo-exponentiation follows from the a priori simpler conjecture that they are elementarily equivalent. An analysis of the firstorder types in pseudo-exponentiation leads to a description of the elementary embeddings, and the result that pseudo-exponential fields are precisely the models of their common first-or...
متن کاملComputing special powers in finite fields
We study exponentiation in nonprime finite fields with very special exponents such as they occur, for example, in inversion, primitivity tests, and polynomial factorization. Our algorithmic approach improves the corresponding exponentiation problem from about quadratic to about linear time.
متن کاملExponentiation of soft photons in a process involving hard photons.
We present a simple method of removing the singularities associated with soft photon emission to all orders in perturbation theory through exponentiation, while keeping a consistent description of hard photon emission. We apply this method to the process e + e ? ! + ? + n where we include both Z 0 and exchange and retain the muon mass dependence. The photonic radiation is allowed to be radiated...
متن کاملComparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement and implemented elliptic curve point multiplication for 160-bit, 192-bit, and 224-bit NIST/SECG curves over GF(p) and RSA-1024 and RSA-2048 on two 8-bit microcontrollers. To accelerate multiple-precision multiplication...
متن کاملPseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor
In this paper we explore pseudo-random number generation on the IBM 4758 Secure Crypto Coprocessor. In particular we compare several variants of Gennaro's provably secure generator, proposed at Crypto 2000, with more standard techniques based on the SHA-1 compression function. Our results show how the presence of hardware support for modular multiplication and exponentiation aaects these algori...
متن کاملDiscrete logarithms over finite fields
Discrete exponentiation in a finite field is a direct analog of ordinary exponentiation. The exponent can only be an integer, say n, but for w in a field F , w is defined except when w = 0 and n ≤ 0, and satisfies the usual properties, in particular w = ww and (for u and v in F ) (uv) = uv. The discrete logarithm is the inverse function, in analogy with the ordinary logarithm for real numbers. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000